Pairing in Characteristic Three
نویسندگان
چکیده
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the ηT pairing in characteristic three and suggest further improvements. These algorithms involve addition, multiplication, cubing, inversion, and sometimes cube root extraction over F3m . We propose a hardware accelerator based on a unified arithmetic operator able to perform the operations required by a given algorithm. We describe the implementation of a compact coprocessor for the field F397 given by F3[x]/(x 97 +x +2), which compares favorably with other solutions described in the open literature.
منابع مشابه
A Comparison between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m
In this article we propose a study of the modified Tate pairing in characteristics two and three. Starting from the ηT pairing introduced by Barreto et al. [1], we detail various algorithmic improvements in the case of characteristic two. As far as characteristic three is concerned, we refer to the survey by Beuchat et al. [5]. We then show how to get back to the modified Tate pairing at almost...
متن کاملPerformance Evaluation of the NOMA in Imperfect SIC Mode and Ergodic Capacity Maximization with User Pairing Scenario in Three Users Groups
This paper evaluates the problem of user pairing scenario with similar channel conditions in NOMA with three users per pair. The small difference in the channel gain of the paired users leads to interference in the process of successive interference cancelation (SIC). The incidence of imperfect SIC reduces system capacity. Also, mid users in this scenario will be deprived of the advantages prov...
متن کاملAn Algorithm for the ηT Pairing Calculation in Characteristic Three and its Hardware Implementation
In this paper, we propose a modified ηT pairing algorithm in characteristic three which does not need any cube root extraction. We also discuss its implementation on a low cost platform which hosts an Altera Cyclone II FPGA device. Our pairing accelerator is ten times faster than previous known FPGA implementations in characteristic three.
متن کاملTate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pairing. Hence it is necessary to develop more efficient implementations of the Tate pairing for the practical application of pairing based cryptosystems. In 2002, Barreto et al. and Galbraith et al. provided new algorith...
متن کاملEfficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
After Miller’s original algorithm for the Tate pairing computation, many improved algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al., especially for the fields with characteristic three. Also Duursma and Lee found a closed formula of the Tate pairing computation for the fields with characteristic three. In this paper, we show that a similar argument is al...
متن کاملEfficient Hardware for the Tate Pairing Calculation in Characteristic Three
In this paper the benefits of implementation of the Tate pairing computation in dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field GF (3) are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field GF (3). Using this approach an architecture for the hard...
متن کامل